Combining static priority and weighted round-robin like packet scheduling in AFDX for incremental certification and mixed criticality support

نویسنده

  • Marc BOYER
چکیده

Avionics Full DupleX (AFDX) is an aeronautic-specific switched Ethernet technology that provides data exchanges among avionics sub-systems with bounded latencies, without requiring the sub-systems to share a common global clock like in TDMA networks. These predictable latencies can be achieved because the workload submitted to the network by each sub-system is upper bounded and known in advance, and because the standard enforces appropriate switching mechanisms within the communication switches. In particular, the packets waiting to be sent on an output port of a communication switch are to be stored in a FIFO queue or in distinct queues depending on their priorities (high or low). The use of priorities (static priorities on a per-flow basis) actually helps meeting more stringent latencies for the most critical data flows than what would be feasible with FIFO queues alone. However, scheduling with priorities in itself does not provide a solution to the issue of incremental certification. Indeed adding a single data stream may have an impact on all the other streams that are transmitted, which requires recomputing the upper bounds on the latencies, and, possibly, involves reconfiguring the communication parameters throughout the whole system. In this paper, we study the combined use of static priority and Deficit Round Robin (DRR) to schedule the transmissions of the packets on the output links of the AFDX switches. DRR is a low-complexity weighted round-robin like policy which allows the flows to share the available bandwidth according to some pre-defined percentages. Practically, DRR guarantees that a flow or a set of flows will be provided at run-time at least the share of bandwidth that has been allocated to them. If some spare bandwidth is provisioned for future use, it becomes possible to add new data flows to an existing system without any impact on the real-time performances of the pre-existing flows. Importantly, this opens the doors to incremental certification. Among the numerous variants of Round-Robin, DRR is an appealing policy in the avionics context because it is predictable in terms of worst-case latencies [1,2] and the associated run-time overhead within the switches is contained (there are O(1) implementations [3]). Besides, DRR does not require any changes in the AFDX frame format or at the end-systems level (e.g. communication stack): only the switches needs to implement new mechanisms and offer additional configuration parameters. However, AFDX is often intended to support traffic with mixedcriticalities, specifically in terms of timing requirements, which cannot be achieved with DRR alone since increasing the bandwidth share for a flow or a set of flows does not decrease the worst-case latency. As we will explain, this can be best achieved by using priorities that reflects the criticalities of the flows. The first objective of the paper is to study how DRR and prioritized scheduling can be best used in a combined manner, in order to support both incremental certification and data flows with mixed timing criticalities. This question will be discussed considering the evolutions that can be foreseen in terms of technology (e.g., Gbit/s switches) and traffic characteristics (e.g., increasing low-criticality entertainment-related traffic). The second objective and core contribution of the paper is to provide a quantitative assessment on realistic case-studies[4] that supports our proposal and identifies its range of applicability. Specifically, the latency overhead with DRR (wrt to priority scheduling) will be evaluated and it will be shown that, be it at 100Mbit/s or 1Gbit/s, DDR alone is not suited for the most stringent timing constraints. Then, it will be shown that, taking advantage of the increasing bandwidth, combining static priority and DRR provides a practical and efficient solution for next generation avionics systems with mixed-criticality traffic and the need for incremental certification.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Short-frame Prior Scheduling with WRR Transmission Strategy in AFDX Terminal System

A new scheduling strategy of terminal system virtual link (VL) is put forward, which is based on the short-frame prior scheduling and integrated with weighted round robin (WRR).The new approach, ensured the priority of the important short-frame and balanced the delay upper bound of other different priority signals. Based on the theory of network calculus, the paper derived the delay upper bound...

متن کامل

Experimental Results for Class-Based Queueing

This paper describes the experience of implementing CBQ's top-level link sharing code as described previously in [FJ95]. This implementation incorporates work from previous implementations of Class-Based Queueing from LBNL [Jac95] and UCL [WGC 95]. This implementation extends the work of previous implementations by incorporating both Top-Level link-sharing and Weighted Round Robin within priori...

متن کامل

Incorporating TSN/BLS in AFDX for Mixed-Criticality Avionics Applications: Specification and Analysis

In this paper, we propose an extension of the AFDX standard, incorporating a TSN/BLS shaper, to homogenize the avionics communication architecture, and enable the interconnection of different avionics domains with mixed-criticality levels, e.g., legacy AFDX traffic, Flight Control and In-Flight Entertainment. First, we present the main specifications of such a proposed solution. Then, we detail...

متن کامل

A Practical Scheduler For High-Speed Packet Switches and Internet Routers

The input queued (IQ) crossbar based switching, employing virtual output queueing (VOQ), is the dominant architecture for high-performance packet switches. The performance of a VOQ switch depends solely on the scheduling algorithm used. Maximum Weight Matching (MWM) algorithms have optimal performance however they are not practical due to their hardware complexity. Round Robin (RR) based algori...

متن کامل

A load-aware weighted round-robin algorithm forIEEE 802.16 networks

The IEEE 802.16 standard was designed to provide quality-of-service (QoS) guarantees for various classes of traffic with diverse QoS requirements. Packet-scheduling algorithms play a critical role in providing such guarantees. Weighted round robin (WRR) is one of the most commonly used scheduling algorithms, because of its simplicity and low computational overhead. However, it suffers from perf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013